Realtime Burstiness Measurement
نویسندگان
چکیده
Bursty traffic causes excessive queuing delay and packet losses. Many researchers have proposed the modeling of burstiness and burstiness mitigation schemes. However, there is no consensus on a quantitative definition of burstiness. In this paper, burstiness is defined as the queue size of a virtual bottleneck buffer. This definition is based on the fact that packets are queued when there is a bottleneck, and then the difference between target and service rates is reflected in queue length, i.e. the amount of data stored at the buffer before the bottleneck. We design and implement a realtime burstiness measurement method on a fully programmable network testbed, GtrcNET-1. Furthermore, we measure actual traffic on two networks, and we present the relationship between burstiness and the packet loss rate, and the behavior of flow aggregation. The results show the effectiveness of both the definition and our measurement method.
منابع مشابه
Probabilistic Burstiness-Curve-Based Connection Control for Real-Time Multimedia Services in ATM Networks
In this paper we present a method to establish realtime connections with guaranteed quality of service (QOS), based on a per-session probabilistic burstiness curve (PBC). Under two distinctive service disciplines, rate proportional processor sharing and fixed rate processor sharing, we derive useful probabilistic bounds on per-session end-to-end loss which is caused by either buffer overflow in...
متن کاملInferring Traffic Burstiness by Sampling the Buffer Occupancy
Common practice to determine the required bandwidth capacity for a network link is to measure the 5 minute average link load, and then add a safety margin to cater for the effect of burstiness on small time-scales. Because of the substantial measurement efforts required to determine the burstiness, network managers often rely on rules of thumb to find the safety margin, e.g. ‘mean plus 50%’. In...
متن کاملFast symbolic computation of the worst-case delay in tandem networks and applications
Computing deterministic performance guarantees is a defining issue for systems with hard realtime constraints, like reactive embedded systems. In this paper, we use burst-rate constrained arrivals and ratelatency servers to deduce tight worst-case delay bounds in tandem networks under arbitrary multiplexing. We present a constructive method for computing the exact worst-case delay, which we pro...
متن کاملBurstProbe: Debugging Time-Critical Data Delivery in Wireless Sensor Networks
In this paper we present BurstProbe, a new technique to accurately measure link burstiness in a wireless sensor network employed for time-critical data delivery. Measurement relies on shared probing slots that are embedded in the transmission schedule and used by nodes to assess link burstiness over time. The acquired link burstiness information can be stored in the node's ash memory and relied...
متن کاملA Burstiness Control for TCP
In this paper, we propose a two-layer model for TCP traffic with burstiness effect. We show that the backlog in bottleneck queue is bounded by the sum of two components: the long term effect of congestion window control algorithm and the short term effect of burstiness. This motivates a formal definition of burstiness. A simple algorithm is proposed to measure and control burstiness at the send...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006